K-catenation and applications: k-prefix codes.dvi
نویسندگان
چکیده
Some generalizations of the usual operations of catenation and quotient of languages are introduced and studied. In particular, language equations involving these operations are considered. Infinite hierarchies of classes of prefix codes and classes of equivalence relations are defined and investigated in connection respectively with the classical notions of prefix codes and right syntactic congruences.
منابع مشابه
Insertion and Deletion for Involution Codes
This paper introduces a generalization of the operation of catenation: u[k]lv, the left-k-insertion, is the set of all words obtained by inserting v into u in positions that are at most k letters away from the left extremity of the word u. We define k-suffix codes using the left-kinsertion operation and extend the concept of k-prefix and k-suffix codes to involution k-prefix and involution k-su...
متن کاملState Complexity of Combined Operations for Prefix-Free Regular Languages
We investigate the state complexity of combined operations for prefix-free regular languages. Prefix-free minimal deterministic finitestate automata have a unique structural property that plays an important role to obtain the precise state complexity of basic operations. Based on the same property, we establish the precise state complexity of four combined operations: star-of-union, star-of-int...
متن کاملState complexity of multiple Boolean and catenation operations
In the last decade, many new results in the area of state complexity have been obtained. Some are about Boolean operations, e.g. intersection, union and catenation and most of them focused on the cases of these operations on two languages. But in the practical applications, these operations are often required to be performed multiple times on three or more languages. The state complexity of the...
متن کاملNondeterministic State Complexity of Basic Operations for Prefix-Free Regular Languages
We investigate the nondeterministic state complexity of basic operations for prefix-free regular languages. The nondeterministic state complexity of an operation is the number of states that are necessary and sufficient in the worst-case for a minimal nondeterministic finite-state automaton that accepts the language obtained from the operation. We establish the precise state complexity of caten...
متن کاملControl over Catenation in Pillared Paddlewheel Metal−Organic Framework Materials via Solvent-Assisted Linker Exchange
Control over catenation in a pillared paddlewheel metal−organic framework was achieved via solventassisted linker exchange. The linker exchange was demonstrated on the noncatenated structure of DO-MOF, by using 4,4′-bipyridine (L4) and 4,4′-azobis(pyridine) (L5) as linkers, leading to noncatenated materials SALEM-3 and SALEM-4. The de novo synthesized analogues of SALEM-3 and SALEM4 can only be...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
عنوان ژورنال:
دوره شماره
صفحات -
تاریخ انتشار 1995